Coding theorems for the compound semi-continuous memoryless channels
نویسندگان
چکیده
منابع مشابه
Coding and decoding for time-discrete amplitude-continuous memoryless channels
In this report we consider some aspects of the general problem of encoding and decoding for time-discrete, amplitude-continuous memoryless channels. The results can be summarized under three main headings. 1. Signal Space Structure: A scheme for constructing a discrete signal space, for which sequential encoding-decoding methods are possible for the general continuous memoryless channel, is des...
متن کاملTheory : Coding Theorems for Discrete Memoryless Systems
The modern study of transmission and storage of information through noisy communication channels goes back to Claude E. Shannon [4]. It is very rare that an intellectual discipline is initiated from scratch, and its framework fully given, as well as its many basic theorems proven by the initiator–but that’s exactly what Shannon did. This has made Shannon a very tough act to follow. By its natur...
متن کاملOn Two Strong Converse Theorems for Stationary Discrete Memoryless Channels
In 1973, Arimoto proved the strong converse theorem for the discrete memoryless channels stating that when transmission rate R is above channel capacity C, the error probability of decoding goes to one as the block length n of code word tends to infinity. He proved the theorem by deriving the exponent function of error probability of correct decoding that is positive if and only if R > C. Subse...
متن کاملLinear Universal Decoder for Compound Discrete Memoryless Channels
Shannon in his seminal work [1] formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity channel capacity was coined to give an operational meaning on the ultimate limit of information transfer between two entities, transmitter and receiver. By using a random coding argum...
متن کاملAdaptive joint H.263-channel coding for memoryless binary channels
The main purpose of this paper is to show that once the video source coding is dependent on the channel characteristics, better performance can be achieved in terms of reconstructed video quality. Our study considers a fixed overall bit rate transmission of 64 kbit/s over error prone memoryless binary channels and the source coder is the ITU-T H.263 video standard. The variable H.263 source cod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kodai Mathematical Journal
سال: 1965
ISSN: 0386-5991
DOI: 10.2996/kmj/1138845016